An Efficient Explicit-time Description Method for Timed Model Checking
نویسندگان
چکیده
منابع مشابه
An Efficient Explicit-time Description Method for Timed Model Checking
Timed model checking, the method to formally verify real-time systems, is attracting increasing attention from both the model checking community and the real-time community. Explicit-time description methods verify real-time systems using general model constructs found in standard un-timed model checkers. Lamport proposed an explicit-time description method [17] using a clock-ticking process (T...
متن کاملEfficient timed model checking for discrete-time systems
We consider model checking of timed temporal formulae in durational transition graphs (DTGs), i.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions of CTL where subscripts put quantitative constraints on the time it takes before a property is satisfied. We exhibit an important gap between logics where sub...
متن کاملAn Efficient Implementation of Phase Field Method with Explicit Time Integration
The phase field method integrates the Griffith theory and damage mechanics approach to predict crack initiation, propagation, and branching within one framework. No crack tracking topology is needed, and complex crack shapes can be captures without user intervention. In this paper, a detailed description of how the phase field method is implemented with explicit dynamics into LS-DYNA is provide...
متن کاملDeep Random Search for Efficient Model Checking of Timed Automata
We present DRS (Deep Random Search), a new Las Vegas algorithm for model checking safety properties of timed automata. DRS explores the state space of the simulation graph of a timed automaton by performing random walks up to a prescribed depth. Nodes along these walks are then used to construct a random fringe, which is the starting point of additional deep random walks. The DRS algorithm is c...
متن کاملZenoness detection and timed model checking for real time systems
In this paper, we consider the time Petri net model (TPN model) and show how to detect zenoness using the state class method. Zenoness is a situation which suggests that an infinity of actions may take place in a finite amount of time. This behavior is often considered as pathological since it violates a fundamental requirement for timed systems for they cannot be infinitely fast. Models violat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.14.6